/*
	STL Overview:

	Mainly used in competitive programming and platforms like LeetCode.
	STL provides many convenient data structures and algorithms, making C++ coding faster and easier.

---

	Commonly used containers:

	* <vector> : Dynamic array
	* <string> : String handling
	* <algorithm> : Standard algorithms (sort, min/max, etc.)
	* <unordered_map> : Hash map, O(1) average access
	* <unordered_set> : Hash set
	* <queue> : FIFO structure, also includes priority_queue
	* <stack> : LIFO structure

---

	Other useful containers:

	* <map> : Ordered map
	* <set> : Ordered set
	* <deque> : Double-ended queue
	* <list> : Doubly linked list, useful for LRU cache

---

	Multi-containers:

	* <multiset> : Allows duplicate elements, ordered
	* <multimap> : Map with duplicate keys
	* <unordered_multiset> : Hash set with duplicates
	* <unordered_multimap> : Hash map with duplicate keys
	* <bitset> : Efficient bit operations
	* <array> : Fixed-size array, safer than C-style arrays

---

	Utilities and algorithms:

	* <numeric> : accumulate, gcd, lcm
	* <functional> : Function objects, e.g., greater<>
	* <utility> : pair, swap, move
	* <iterator> : Iterator utilities

---

	Other useful headers:

	* <memory> : Smart pointers
	* <tuple> : Fixed-size collection of heterogeneous elements
	* <chrono> : Time measurement
	* <complex> : Complex numbers
	* <valarray> : High-performance array operations

---

	Commonly used headers for 95% of problems:
	vector, string, algorithm, unordered_map, unordered_set, queue, stack, priority_queue, map, set

	Understanding STL basics is sufficient for most coding problems, mastering these gives a strong foundation.
*/
